Solving LP Problems via Weighted Centers
نویسندگان
چکیده
منابع مشابه
Solving LP Problems via Weighted Centers
The feasibility problem for a system of linear inequalities can be converted into an unconstrained optimization problem by using ideas from the ellipsoid method, which can be viewed as a very simple minimization technique for the resulting nonlinear function. This function is related to the volume of an ellipsoid containing all feasible solutions, which is parametrized by certain weights which ...
متن کاملSolving resource constrained shortest path problems with LP-based methods
In the resource constrained shortest path problem (RCSPP) there is a directed graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resource types with finite capacities. A minimum cost source-destination directed path is sought such that the total consumption of the arcs from each resource type does not ...
متن کاملPascal Subroutines for Solving Some problems in Interval LP
This paper deals with the Pascal subroutines for solving certain problems in the interval linear programming, especially with calculating the exact range, i.e. the supremum and the in mum of optimal objective function values of a family of LP problems in which all coe cients in constraints vary in given intervals. A theoretical background of the algorithms and a description of the package is in...
متن کاملKorovkin-Type Theorems in Weighted Lp-Spaces via Summation Process
Korovkin-type theorem which is one of the fundamental methods in approximation theory to describe uniform convergence of any sequence of positive linear operators is discussed on weighted Lp spaces, 1 ≤ p < ∞ for univariate and multivariate functions, respectively. Furthermore, we obtain these types of approximation theorems by means of A-summability which is a stronger convergence method than ...
متن کاملSolving Vertex Coloring Problems as Maximum Weighted Stable Set Problems
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph in such a way that adjacent vertices receive different colors, and the objective is to minimize the cost of the used colors. In this work we solve four different coloring problems formulated as Maximum Weight Stable Set Problems on an associated graph. We exploit the transformation proposed by C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1996
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623493254273